MSCP: Recent Accomplishments
نویسندگان
چکیده
منابع مشابه
Solving the minimum sum coloring problem via binary quadratic programming
In recent years, binary quadratic programming (BQP) has been 7 successively applied to solve several combinatorial optimization problems. We 8 consider in this paper a study of using the BQP model to solve the minimum 9 sum coloring problem (MSCP). For this purpose, we recast the MSCP with 10 a quadratic model which is then solved via a recently proposed Path Relink11 ing (PR) algorithm designe...
متن کاملSomme Coloration De Graphe
RÉSUMÉ : Dans cet article nous étudions le problème de la somme coloration minimale (MSCP) qui consiste à trouver une coloration des sommets d’un graphe, utilisant des entiers naturels, telle que la somme des couleurs est minimale. Nous présentons une synthèse des travaux sur MSCP, ainsi qu’une nouvelle famille d’algorithmes gloutons pour MSCP. Nous proposons une étude de bornes inférieures bas...
متن کاملSingle-cell isolation by a modular single-cell pipette for RNA-sequencing.
Single-cell transcriptome sequencing highly requires a convenient and reliable method to rapidly isolate a live cell into a specific container such as a PCR tube. Here, we report a modular single-cell pipette (mSCP) consisting of three modular components, a SCP-Tip, an air-displacement pipette (ADP), and ADP-Tips, that can be easily assembled, disassembled, and reassembled. By assembling the SC...
متن کاملSum Coloring : New upper bounds for the chromatic strength
The Minimum Sum Coloring Problem (MSCP ) is derived from the Graph Coloring Problem (GCP ) by associating a weight to each color. The aim ofMSCP is to find a coloring solution of a graph such that the sum of color weights is minimum.MSCP has important applications in fields such as scheduling and VLSI design. We propose in this paper new upper bounds of the chromatic strength, i.e. the minimum ...
متن کاملA Comprehensive Analysis of Indirect Branch Prediction
Indirect branch prediction is a performance limiting factor for current computer systems, preventing superscalar processors from exploiting the available ILP. Indirect branches are responsible for 55.7% of mispredictions in our benchmark set, although they only stand for 15.5% of dynamic branches. Moreover, a 10.8% average IPC speedup is achievable by perfectly predicting all indirect branches....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007